Fast Convex 3D Polygons Overlap Testing
نویسنده
چکیده
This paper presents a fast method for computing whether or not two convex polygons in three dimensions intersect. The test relies exclusively on the sign of 4 4 determinants. The source code is available online.
منابع مشابه
Fast Sampling Plane Filtering, Polygon Construction and Merging from Depth Images
Recently, the availability of low cost depth cameras has provided 3D sensing capabilities for mobile robots in the form of dense 3D point clouds, usable for applications like 3D mapping and reconstruction, shape analysis, pose tracking and object recognition. For all the aforementioned applications, processing the raw 3D point cloud in real time and at full frame rates may be infeasible due to ...
متن کاملMeasuring Convexity via Convex Polygons
This paper describes a general approach to compute a family of convexity measures. Inspired by the use of geometric primitives (such as circles) which are often fitted to shapes to approximate them, we use convex polygons for this task. Convex polygons can be generated in many ways, and several are demonstrated here. These polygons are scaled and translated to ensure that they fit the input sha...
متن کاملRotational Polygon Overlap Minimization and Compaction 1
An eeective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P 1 ; P 2 ; P 3 ; : : : ; P k in a container polygon Q, translate and rotate the polygons to diminish their overlap to a local minimum. A (local) overlap minimum has the property that any perturbation of the polygons increases the overlap. Overlap minimization is modiied to creat...
متن کاملRotational polygon overlap minimization and compaction
An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1, P2, P3, . . . , Pk in a container polygon Q, translate and rotate the polygons to diminish their overlap to a local minimum. A (local) overlap minimum has the property that any perturbation of the polygons increases the overlap. Overlap minimization is modified to create a p...
متن کاملOverlapping Area Computation between Irregular Polygons for Its Evolutionary Layout Based on Convex Decomposition
Low efficiency of interference calculation has become the bottleneck that restricts further development of the performance of evolutionary algorithm for the polygon layout. To solve the problem, in this paper, we propose an algorithm of calculating overlapping area between two irregular polygons. For this algorithm, at first, two irregular polygons are respectively decomposed into the minimum n...
متن کامل